Automated deduction with associative-commutative operators
نویسندگان
چکیده
منابع مشابه
Associative-commutative Deduction with Constraints Associative-commutative Deduction with Constraints
Associative-commutative equational reasoning is known to be highly complex for theorem proving. Hence, it is very important to focus deduction by adding constraints, such as uniication and ordering, and to deene eecient strategies, such as the basic requirements a la Hullot. Constraints are formulas used for pruning the set of ground instances of clauses deduced by a theorem prover. We propose ...
متن کاملAutomated Verification by Induction with Associative-Commutative Operators
Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets, : : : are ubiquitous in software and hardware veriication. These AC operators are diicult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. ...
متن کاملAutomated Veri cation by Induction and Associative-Commutative Operators
Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets, : : : are ubiquitous in software and hardware veriication. These AC operators are diicult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. ...
متن کاملAssociative-Commutative Deducibility Constraints
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associative and commutative symbols. We show that deciding such Diophantine systems is, in general, undecidable. Then, we consider a simple subclass, which we show decidable. Though the solutions of these problems are not neces...
متن کاملAssociative-Commutative Rewriting
We are currently extending the rewrite system labora tory REVE to handle associative-commutative operators. In particular, we are incorporating a set of rules for Boolean algebra that provides a refutationally-complete theorem prover and a new programming paradigm. To that end, we describe methods for proving termination of associativecommutative systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 1995
ISSN: 0938-1279,1432-0622
DOI: 10.1007/bf01270929